Influence maximization on temporal networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Influence Maximization in Undirected Networks

We consider the problem of finding a set of k vertices of maximal total influence in a given undirected network, under the independent cascade (IC) model of influence spread. It is known that influence is submodular in the IC model, and hence a greedy algorithm achieves a (1 − 1/e) approximation to this problem; moreover, it is known to be NP-hard to achieve a better approximation factor in dir...

متن کامل

Mathematical Programming Models for Influence Maximization on Social Networks

Chen [2009] proposed the Target Set Selection (TSS) problem: • Given a connected undirected graph G = V; E . For each i ∈ V, there is a threshold, gi, which is between 1 and degree(i). All nodes are inactive initially. • Select a subset of nodes, the target set, and they become active immediately. • After that, in each step, an inactive node i becomes active if at least gi of its neighbors are ...

متن کامل

Estimate on Expectation for Influence Maximization in Social Networks

Finding the most influential nodes is an important issue in social network analysis. To tackle this issue, Kempe et al. proposed the natural greedy strategy, which, although provides a good approximation, suffers from high computation cost on estimating the influence function even if adopting an efficient optimization. In this paper, we propose a simple yet effective evaluation, the expectation...

متن کامل

Influence Maximization in Continuous Time Diffusion Networks

The problem of finding the optimal set of source nodes in a diffusion network that maximizes the spread of information, influence, and diseases in a limited amount of time depends dramatically on the underlying temporal dynamics of the network. However, this still remains largely unexplored to date. To this end, given a network and its temporal dynamics, we first describe how continuous time Ma...

متن کامل

Stigmergy-Based Influence Maximization in Social Networks

Influence maximization is an important research topic which has been extensively studied in various fields. In this paper, a stigmergybased approach has been proposed to tackle the influence maximization problem. We modelled the influence propagation process as ant’s crawling behaviours, and their communications rely on a kind of biological chemicals, i.e., pheromone. The amount of the pheromon...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 2020

ISSN: 2470-0045,2470-0053

DOI: 10.1103/physreve.102.042307